Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks
نویسندگان
چکیده
Many papers on the fully connected cubic networks have been published for the past several years due to its favorite properties. In this paper, we consider the fault-tolerant hamiltonian connectivity and fault-tolerant hamiltonicity of the fully connected cubic network. We use FCCNn to denote the fully connected cubic network of level n. Let G = (V, E) be a graph. The fault-tolerant hamiltonian connectivity H f (G) is defined to be the maximum integer l such that G − F remains hamiltonian connected for every F ⊂ V(G) ∪ E(G) with |F| ≤ l. The fault-tolerant hamiltonicity Hf (G) is defined to be the maximum integer l such that G − F remains hamiltonian for every F ⊂ V(G) ∪ E(G) with |F| ≤ l. We prove that H f (FCCNn) = 0 and Hf (FCCNn) = 1 if n ≥ 2.
منابع مشابه
Fault-tolerant hamiltonian connectedness of cycle composition networks
It is important for a network to tolerate as many faults as possible. With the graph representation of an interconnection network, a k-regular hamiltonian and hamiltonian connected network is super fault-tolerant hamiltonian if it remains hamiltonian after removing up to k 2 vertices and/or edges and remains hamiltonian connected after removing up to k 3 vertices and/or edges. Super fault-toler...
متن کاملA recursively construction scheme for super fault-tolerant hamiltonian graphs
For the interconnection network topology, it is usually represented by a graph. When a network is used, processors and/or links faults may happen. Thus, it is meaningful to consider faulty networks. We consider k-regular graphs in this paper. We define a k-regular hamiltonian and hamiltonian connected graph G is super fault-tolerant hamiltonian if G remains hamiltonian after removing at most k ...
متن کاملFault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
Fault-tolerant hamiltonicity and faulttolerant hamiltonian connectivity of the folded Petersen cube networks Cheng-Kuan Lin a , Tung-Yang Ho b , Jimmy J.M. Tan a & Lih-Hsing Hsu c a Department of Computer Science , National Chiao Tung University , Hsinchu, Taiwan, Republic of China b Department of Industrial Engineering and Management , Ta Hwa Institute of Technology , Hsinchu, Taiwan, Republic...
متن کاملFault Hamiltonicity of the Shuffle - Cubes ∗
Hypercubes are famous interconnection networks. The shuffle cubes are proposed as its variation with lower diameter. In this paper, we concentrate on the fault tolerant hamiltonicity and hamiltonian connectivity of the shuffle cube. We say that a graph G is f-hamiltonian if there is a hamiltonian cycle in G − F and is f-hamiltonian connected if there is a hamiltonian path between any two vertic...
متن کاملPanconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Jwo et al. [Networks 23 (1993) 315–326] introduced the alternating group graph as an interconnection network topology for computing systems. They showed that the proposed structure has many advantages over n-cubes and star graphs. For example, all alternating group graphs are hamiltonian-connected (i.e., every pair of vertices in the graph are connected by a hamiltonian path) and pancyclic (i.e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 25 شماره
صفحات -
تاریخ انتشار 2009